Communication in task-parallel ILU-preconditioned CG solvers using MPI + OmpSs
نویسندگان
چکیده
منابع مشابه
Task-Parallel Reductions in OpenMP and OmpSs
The wide adoption of parallel processing hardware in mainstream computing as well as the raising interest for efficient parallel programming in the developer community increase the demand for parallel programming model support for common algorithmic patterns. In this paper we present an extension to the OpenMP task construct to add support for reductions in while-loops and general-recursive fun...
متن کاملParallel Preconditioning Techniques for Sparse CG Solvers
Conjugate gradient (CG) methods to solve sparse systems of linear equations play an important role in numerical methods for solving discretized partial diierential equations. The large size and the condition of many technical or physical applications in this area result in the need for eecient par-allelization and preconditioning techniques of the CG method. In particular for very ill-condition...
متن کاملAutomatic parallelization of vector parallel codes for preconditioned iterative solvers
There is a lot of effort to make programming for HPC more productive and we are to make our contribution. After gaining some experience in programming preconditioned iterative solvers in Fortran and MPI we propose new approach, that is based on the mixed ideas from vector parallel languages and parallelizing compilers like HPF. We follow two rules, first try to vectorize our code as much as pos...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملConvergence acceleration method of large-scale parallel iterative solvers for heterogeneous properties
In large-scale scienti c computing, linear sparse solver is one of the most time-consuming process. In GeoFEM, various types of preconditioned iterative method is implemented on massively parallel computers. It has been well-known that ILU(0) factorization is very e ective preconditioning method for iterative solver. But it's also well-known that this method requires global data dependency and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrency and Computation: Practice and Experience
سال: 2017
ISSN: 1532-0626
DOI: 10.1002/cpe.4280